A polyhedral approach to sequence alignment problems
نویسندگان
چکیده
منابع مشابه
A polyhedral approach to sequence alignment problems
We study two new problems in sequence alignment both from a practical and a theoretical view, using tools from combinatorial optimization to develop branchand-cut algorithms. The Generalized Maximum Trace formulation captures several forms of multiple sequence alignment problems in a common framework, among them the original formulation of Maximum Trace. The RNA Sequence Alignment Problem captu...
متن کاملA Polyhedral Approach to Grouping Problems
To many people, mathematics may look like series of true statements, with the corresponding irrefutable proofs, ordered in a perfectly logical manner. Perhaps one would expect that the process of writing a mathematical thesis reflects this image. My experiences were quite different. To me it was a time of guesses and doubts, of conjectures, for which proofs and refutations were proposed to shoo...
متن کاملA Polyhedral Approach to Planar Augmentation and Related Problems
Given a planar graph G the planar biconnectivity augmen tation problem is to add the minimum number of edges to G such that the resulting graph is still planar and biconnected Given a nonplanar and biconnected graph the maximum planar biconnected subgraph problem consists of removing the minimum number of edges so that planarity is achieved and biconnectivity is maintained Both problems are imp...
متن کاملA polyhedral approach to single-machine scheduling problems
We report new results for a time-indexed formulation of nonpreemptive singlemachine scheduling problems. We give complete characterizations of all facet inducing inequalities with integral coefficients and right-hand side 1 or 2 for the convex hull of the set of feasible partial schedules, i.e., schedules in which not all jobs have to be started. Furthermore, we identify conditions under which ...
متن کاملA SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. This paper describes a new integer program formulation that generates models small enough to be passed to generic solvers. The formulation is a hybrid relating the sparse alignment graph with a compact encoding of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00194-3